var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&authorFirst=1&nocache=1&fullnames=1&theme=bullets&group0=year&group1=type&owner={}&filter=tags:OppComm&jsonp=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&authorFirst=1&nocache=1&fullnames=1&theme=bullets&group0=year&group1=type&owner={}&filter=tags:OppComm&jsonp=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&authorFirst=1&nocache=1&fullnames=1&theme=bullets&group0=year&group1=type&owner={}&filter=tags:OppComm&jsonp=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2011\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n 2\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n S. Dusad; and S N. Diggavi.\n\n\n \n \n \n \n \n On successive refinement of diversity for fading ISI channels.\n \n \n \n \n\n\n \n\n\n\n IEEE Transactions on Communications, 59: 1820-1829. December 2011.\n \n\n\n\n
\n\n\n\n \n \n \"On arxiv\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DDj11,\n abstract = {We show that the diversity-multiplexing tradeoff in fading inter-symbol interference (ISI) channels with a single degree of freedom (MISO/SIMO) is\nsuccessively refinable. This demonstrates that ideal opportunistic codes can be designed\nasymptotically in SNR.},\n author = {S. Dusad and S N. Diggavi},\n file = {:papers:ddsucrefisi.pdf},\n journal = {IEEE Transactions on Communications},\n month = {December},\n pages = {1820-1829},\n tags = {journal,DivEmb,SucRefDiv,STcodes,OppComm,DegMsgSet},\n title = {On successive refinement of diversity for fading ISI channels},\n type = {2},\n url_arxiv = {http://arxiv.org/abs/0912.4556},\n volume = {59},\n year = {2011}\n}\n\n
\n
\n\n\n
\n We show that the diversity-multiplexing tradeoff in fading inter-symbol interference (ISI) channels with a single degree of freedom (MISO/SIMO) is successively refinable. This demonstrates that ideal opportunistic codes can be designed asymptotically in SNR.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2009\n \n \n (2)\n \n \n
\n
\n \n \n
\n
\n  \n 2\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n K M Z. Islam; P. Rabiei; N. Al-Dhahir; S N. Diggavi; and A R. Calderbank.\n\n\n \n \n \n \n Linear Diversity-Embedding STBC : Systems Issues and Applications.\n \n \n \n\n\n \n\n\n\n IEEE Transactions on Communications, 57(6): 1578–1583. June 2009.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{IRADC09,\n author = {K M Z. Islam and P. Rabiei and N. Al-Dhahir and S N. Diggavi and A R. Calderbank},\n file = {:papers:tcommdivembfinal.pdf},\n journal = {IEEE Transactions on Communications},\n month = {June},\n note = {},\n number = {6},\n pages = {1578--1583},\n tags = {journal,DivEmb,OppComm,STcodes},\n title = {Linear Diversity-Embedding STBC : Systems Issues and Applications},\n type = {2},\n volume = {57},\n year = {2009}\n}\n\n
\n
\n\n\n\n
\n\n\n \n\n\n\n\n\n
\n
\n\n
\n
\n  \n 4\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n S. Saeedi; S N. Diggavi; C. Fragouli; and V. Prabhakaran.\n\n\n \n \n \n \n On degraded two message set broadcasting.\n \n \n \n\n\n \n\n\n\n In IEEE Information Theory Workshop (ITW) Taormina, Italy, pages 406–410, October 2009. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{SDFPp09,\n abstract = {Abstract—We consider the two message set problem, where a\nsource broadcasts a common message W1 to an arbitrary set of\nreceivers U and a private message W2 to a subset of the receivers\nP !U . Transmissions occur over linear deterministic channels.\nFor the case where at most two receivers do not require the\nprivate message, we give an exact characterization of the capacity\nregion, where achievability is through linear coding.},\n author = {S. Saeedi and S N. Diggavi and C. Fragouli and V. Prabhakaran},\n booktitle = {IEEE Information Theory Workshop (ITW) Taormina, Italy},\n file = {:papers:sdfpitw09.pdf},\n month = {October},\n note = {},\n pages = {406--410},\n tags = {conf,DetApprox,IT,DegMsgSet,OppComm,SelConf},\n title = {On degraded two message set broadcasting},\n type = {4},\n year = {2009}\n}\n\n
\n
\n\n\n
\n Abstract—We consider the two message set problem, where a source broadcasts a common message W1 to an arbitrary set of receivers U and a private message W2 to a subset of the receivers P !U . Transmissions occur over linear deterministic channels. For the case where at most two receivers do not require the private message, we give an exact characterization of the capacity region, where achievability is through linear coding.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2008\n \n \n (2)\n \n \n
\n
\n \n \n
\n
\n  \n 2\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n S N. Diggavi; A R. Calderbank; S. Dusad; and N. Al-Dhahir.\n\n\n \n \n \n \n Diversity Embedded Space-Time Codes.\n \n \n \n\n\n \n\n\n\n IEEE Transactions on Information Theory, 54(1): 33–50. January 2008.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DCDAj08,\n abstract = {This paper introduces diversity embedded codes, which are space-time codes\nthat simultaneously give different levels of diversity protection to different information\nstreams. The paper provides algebraic constructions based on binary codes designed for\nrank distance and lifts them to the complex domain. It also gives several example of\nlinear diversity embedded codes.},\n author = {S N. Diggavi and A R. Calderbank and S. Dusad and  N. Al-Dhahir},\n file = {:papers:dcdafinalversion.pdf},\n journal = {IEEE Transactions on Information Theory},\n label = {ddca_j08},\n month = {January},\n note = {},\n number = {1},\n pages = {33--50},\n tags = {journal,DivEmb,OppComm,RankDistCod,CodTh,STcodes},\n title = {Diversity Embedded Space-Time Codes},\n type = {2},\n volume = {54},\n year = {2008}\n}\n\n
\n
\n\n\n
\n This paper introduces diversity embedded codes, which are space-time codes that simultaneously give different levels of diversity protection to different information streams. The paper provides algebraic constructions based on binary codes designed for rank distance and lifts them to the complex domain. It also gives several example of linear diversity embedded codes.\n
\n\n\n
\n\n\n
\n \n\n \n \n S. Dusad; S N. Diggavi; N. Al-Dhahir; and A R. Calderbank.\n\n\n \n \n \n \n Diversity-Embedded Codes : Theory and practice.\n \n \n \n\n\n \n\n\n\n IEEE Journal on Selected Topics in Signal Processing, 2(2): 202–219. April 2008.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DDACj08,\n abstract = {This paper develops in a unified way the theory for diversity embedded codes\nfor broadband (ISI) channels, both from an information theory viewpoint as well as an\nalgebraic coding perspective. It also develops practical aspects by connecting it to unequal\nerror protection for image transmission as well as using diversity embedded codes in conjunction with NUM.},\n author = {S. Dusad and S N. Diggavi and N. Al-Dhahir and A R. Calderbank},\n file = {:papers:ddac.pdf},\n journal = {IEEE Journal on Selected Topics in Signal Processing},\n month = {April},\n note = {},\n number = {2},\n pages = {202--219},\n tags = {journal,DivEmb,OppComm,RankDistCod,CodTh,SucRefDiv,DegMsgSet,STcodes},\n title = {Diversity-Embedded Codes : Theory and practice},\n type = {2},\n volume = {2},\n year = {2008}\n}\n\n
\n
\n\n\n
\n This paper develops in a unified way the theory for diversity embedded codes for broadband (ISI) channels, both from an information theory viewpoint as well as an algebraic coding perspective. It also develops practical aspects by connecting it to unequal error protection for image transmission as well as using diversity embedded codes in conjunction with NUM.\n
\n\n\n
\n\n\n
\n \n\n \n \n S. Dusad; S N. Diggavi; and A R. Calderbank.\n\n\n \n \n \n \n \n Embedded Rank Distance Codes for ISI channels.\n \n \n \n \n\n\n \n\n\n\n IEEE Transactions on Information Theory, 54(11): 4866–4886. November 2008.\n \n\n\n\n
\n\n\n\n \n \n \"Embedded arxiv\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DDCj08,\n abstract = {This paper introduces the problem of diversity embedded codes for inter-symbol\ninterference (ISI) channels and gives algebraic constructions for them. These constructions\nare based on designing binary rank-distance codes with a specific (Toeplitz-like) constraint\nand lifting them to the complex domain through set-partitioning maps. As a special case\nthese algebraic constructions also give rate-diversity optimal codes for transmission over\nISI channels when there are transmit alphabet constraints.},\n author = {S. Dusad and S N. Diggavi and A R. Calderbank},\n file = {:papers:ddcfinalrankdist.pdf},\n journal = {IEEE Transactions on Information Theory},\n month = {November},\n note = {},\n number = {11},\n pages = {4866--4886},\n tags = {journal,DivEmb,OppComm,RankDistCod,CodTh,STcodes},\n title = {Embedded Rank Distance Codes for ISI channels},\n type = {2},\n url_arxiv = {http://arxiv.org/abs/0707.4311},\n volume = {54},\n year = {2008}\n}\n\n
\n
\n\n\n
\n This paper introduces the problem of diversity embedded codes for inter-symbol interference (ISI) channels and gives algebraic constructions for them. These constructions are based on designing binary rank-distance codes with a specific (Toeplitz-like) constraint and lifting them to the complex domain through set-partitioning maps. As a special case these algebraic constructions also give rate-diversity optimal codes for transmission over ISI channels when there are transmit alphabet constraints.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 4\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n S. Dusad; and S N. Diggavi.\n\n\n \n \n \n \n Successive refinement of diversity for fading ISI MISO channels.\n \n \n \n\n\n \n\n\n\n In IEEE International Symposium on Information Theory (ISIT), Toronto, Canada, pages 1273–1277, July 2008. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DDj08,\n author = {S. Dusad and S N. Diggavi,},\n booktitle = {IEEE International Symposium on Information Theory (ISIT), Toronto, Canada},\n month = {July},\n note = {},\n pages = {1273--1277},\n tags = {conf,DivEmb,SucRefDiv,STcodes,OppComm,DegMsgSet},\n title = {Successive refinement of diversity for fading ISI MISO channels},\n type = {4},\n year = {2008}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2007\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n 4\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n S. Dusad; S N. Diggavi; and A R. Calderbank.\n\n\n \n \n \n \n Rank distance codes for ISI channels.\n \n \n \n\n\n \n\n\n\n In IEEE Information Theory Workshop (ITW) Bergen, Norway, pages 32–36, July 2007. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DDCj07,\n author = {S. Dusad and S N. Diggavi and A R. Calderbank},\n booktitle = {IEEE Information Theory Workshop (ITW) Bergen, Norway},\n month = {July},\n note = {},\n pages = {32--36},\n tags = {conf,DivEmb,OppComm,RankDistCod,CodTh},\n title = {Rank distance codes for ISI channels},\n type = {4},\n year = {2007}\n}\n\n
\n
\n\n\n\n
\n\n\n \n\n\n
\n \n\n \n \n V. Prabhakaran; S N. Diggavi; and D N C. Tse.\n\n\n \n \n \n \n MIMO Broadcasting with degraded message sets: A Deterministic Approach.\n \n \n \n\n\n \n\n\n\n In Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois, September 2007. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{PDTj07,\n abstract = {In this paper we study the nested (degraded) message\nset problem, where user $i$ requires messages\n$W_1, . . . ,W_i$. We study this for a MIMO linear deterministic\nbroadcast channel model, which is motivated by some recent\nsuccesses in using such models to obtain insights into approximate\ncharacterizations for the Gaussian relay and interference\nchannels. We establish the complete solution for the K = 3\nuser nested message problem for the MIMO linear deterministic\nbroadcast channel. We also establish some extremal points for\nthe general K-user case, where there are only two messages of\ninterest.},\n author = {V. Prabhakaran and S N. Diggavi and D N C. Tse},\n booktitle = {Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois},\n file = {:papers:degmsgsetbc07.pdf},\n month = {September},\n note = {},\n pages = {},\n tags = {conf,DetApprox,IT,DegMsgSet,OppComm,SelConf},\n title = {MIMO Broadcasting with degraded message sets: A Deterministic Approach},\n type = {4},\n year = {2007}\n}\n\n
\n
\n\n\n
\n In this paper we study the nested (degraded) message set problem, where user $i$ requires messages $W_1, . . . ,W_i$. We study this for a MIMO linear deterministic broadcast channel model, which is motivated by some recent successes in using such models to obtain insights into approximate characterizations for the Gaussian relay and interference channels. We establish the complete solution for the K = 3 user nested message problem for the MIMO linear deterministic broadcast channel. We also establish some extremal points for the general K-user case, where there are only two messages of interest.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2006\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n 4\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n S. Dusad; S N. Diggavi; and A R. Calderbank.\n\n\n \n \n \n \n Cross Layer Utility of Diversity Embedded Codes.\n \n \n \n\n\n \n\n\n\n In IEEE Conference on Information Sciences and Systems, Princeton, March 2006. \n invited paper\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DDCj06,\n author = {S. Dusad and S N. Diggavi and A R. Calderbank},\n booktitle = {IEEE Conference on Information Sciences and Systems, Princeton},\n month = {March},\n note = {invited paper},\n pages = {},\n tags = {conf,DivEmb,OppComm,SrcChan},\n title = {Cross Layer Utility of Diversity Embedded Codes},\n type = {4},\n year = {2006}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n S. Dusad; and S N. Diggavi.\n\n\n \n \n \n \n On successive refinement of diversity for fading ISI channels.\n \n \n \n\n\n \n\n\n\n In Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois, September 2006. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DDj06,\n author = {S. Dusad and S N. Diggavi,},\n booktitle = {Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois},\n month = {September},\n note = {},\n pages = {},\n tags = {conf,DivEmb,SucRefDiv,STcodes,OppComm,DegMsgSet},\n title = {On successive refinement of diversity for fading ISI channels},\n type = {4},\n year = {2006}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n S N. Diggavi; and D N C. Tse.\n\n\n \n \n \n \n On opportunistic codes and broadcast codes with degraded message sets.\n \n \n \n\n\n \n\n\n\n In IEEE Information Theory Workshop, Uruguay, pages 227–231, March 2006. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DTc06,\n abstract = {Diversity embedded codes are opportunistic codes\nwhich take advantage of good channel realizations while ensuring\nat least part of the information is received reliably for bad\nchannels. We establish a connection between these codes and\ndegraded message set broadcast codes. We characterize the\nachievable rate region for the parallel Gaussian degraded message\nset broadcast problem, when only the strongest user needs\nthe private information. Using this, we partially characterize the\nset of achievable rate-diversity tuples for the diversity embedded\nproblem for parallel fading channels. This shows that the diversity-multiplexing\ntradeoff for the parallel fading channel is not successively refinable.},\n author = {S N. Diggavi and D N C. Tse},\n booktitle = { IEEE Information Theory Workshop, Uruguay},\n file = {:papers:digtseitw06.pdf},\n month = {March},\n note = {},\n pages = {227--231},\n tags = {conf,DivEmb,SucRefDiv,STcodes,OppComm,DegMsgSet,SelConf},\n title = {On opportunistic codes and broadcast codes with degraded message sets},\n type = {4},\n year = {2006}\n}\n\n
\n
\n\n\n
\n Diversity embedded codes are opportunistic codes which take advantage of good channel realizations while ensuring at least part of the information is received reliably for bad channels. We establish a connection between these codes and degraded message set broadcast codes. We characterize the achievable rate region for the parallel Gaussian degraded message set broadcast problem, when only the strongest user needs the private information. Using this, we partially characterize the set of achievable rate-diversity tuples for the diversity embedded problem for parallel fading channels. This shows that the diversity-multiplexing tradeoff for the parallel fading channel is not successively refinable.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2005\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n 4\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n S. Das; N. Al-Dhahir; S N. Diggavi; and A R. Calderbank.\n\n\n \n \n \n \n Opportunistic Space-Time Block Codes.\n \n \n \n\n\n \n\n\n\n In Proceedings of IEEE Vehicular Technology Conference, Dallas, Texas, USA, pages 2025–2029, September 2005. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DADCj05,\n author = {S.  Das and N. Al-Dhahir and S N. Diggavi and A R. Calderbank},\n booktitle = {Proceedings of IEEE Vehicular Technology Conference, Dallas, Texas, USA},\n month = {September},\n note = {},\n pages = {2025--2029},\n tags = {conf,DivEmb,OppComm,STcodes},\n title = {Opportunistic Space-Time Block Codes},\n type = {4},\n year = {2005}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n S N. Diggavi; S. Dusad; A. R. Calderbank; and N. Al-Dhahir.\n\n\n \n \n \n \n On Diversity Embedded codes.\n \n \n \n\n\n \n\n\n\n In Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois, September 2005. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DDCAj05,\n author = {S N. Diggavi and S. Dusad and A. R. Calderbank and N. Al-Dhahir},\n booktitle = {Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois},\n month = {September},\n note = {},\n pages = {},\n tags = {conf,DivEmb,OppComm,RankDistCod,CodTh,SucRefDiv,DegMsgSet},\n title = {On Diversity Embedded codes},\n type = {4},\n year = {2005}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n S N. Diggavi; and D N C. Tse.\n\n\n \n \n \n \n Fundamental limits of diversity embedded codes over fading channels.\n \n \n \n\n\n \n\n\n\n In IEEE International Symposium on Information Theory, Adelaide, Australia, pages 510–514, September 2005. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DTj05,\n abstract = {This paper shows that the diversity multiplexing tradeoff for flat fading\nchannels with a single degree of freedom (MISO/SIMO) is successively refinable.},\n author = {S N. Diggavi and D N C. Tse},\n booktitle = {IEEE International Symposium on Information Theory, Adelaide, Australia},\n file = {:papers:sucrefisit05.pdf},\n month = {September},\n note = {},\n pages = {510--514},\n tags = {conf,DivEmb,SucRefDiv,STcodes,OppComm,DegMsgSet,SelConf},\n title = {Fundamental limits of diversity embedded codes over fading channels},\n type = {4},\n year = {2005}\n}\n\n
\n
\n\n\n
\n This paper shows that the diversity multiplexing tradeoff for flat fading channels with a single degree of freedom (MISO/SIMO) is successively refinable.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2004\n \n \n (2)\n \n \n
\n
\n \n \n
\n
\n  \n 3\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n S N. Diggavi; N. Al-Dhahir; and A R. Calderbank.\n\n\n \n \n \n \n Diversity embedded multiple antenna communications.\n \n \n \n\n\n \n\n\n\n Volume 66 of Series on Discrete Mathematics and Theoretical Computer Science. Diversity embedded multiple antenna communications, pages 285–302. 2004.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inbook{DACib04,\n abstract = {Diversity embedded codes give different levels of diversity protection to \ndifferent information streams. This was the short paper that introduced diversity embedded codes.},\n author = {S N. Diggavi and N. Al-Dhahir and A R. Calderbank},\n booktitle = {AMS edited volume on ``Network Information Theory},\n editors = {P. Gupta G. Kramer and A J. van Wijngaarden},\n file = {{:papers:dimacschap.pdf|}},\n pages = {285--302},\n series = {Series on Discrete Mathematics and Theoretical Computer Science},\n tags = {BookChap,DivEmb,STcodes,OppComm},\n title = {Diversity embedded multiple antenna communications},\n type = {3},\n volume = {66},\n year = {2004}\n}\n\n
\n
\n\n\n
\n Diversity embedded codes give different levels of diversity protection to different information streams. This was the short paper that introduced diversity embedded codes.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 4\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n A R. Calderbank; S N. Diggavi; and N.Al-Dhahir.\n\n\n \n \n \n \n Space-Time Signaling based on Kerdock and Delsarte-Goethals Codes.\n \n \n \n\n\n \n\n\n\n In IEEE International Conference on Communications (ICC), Paris, pages 483–487, June 2004. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{CDAj04,\n author = {A R. Calderbank and S N. Diggavi and N.Al-Dhahir},\n booktitle = {IEEE International Conference on Communications (ICC), Paris},\n month = {June},\n note = {},\n pages = {483--487},\n tags = {conf,DivEmb,OppComm,RankDistCod,CodTh},\n title = {Space-Time Signaling based on Kerdock and Delsarte-Goethals Codes},\n type = {4},\n year = {2004}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n S N. Diggavi; and D N C. Tse.\n\n\n \n \n \n \n On successive refinement of diversity.\n \n \n \n\n\n \n\n\n\n In Allerton Conference on Communication, Control, and Computing, Illinois, September 2004. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DTj04,\n author = {S N. Diggavi and D N C. Tse},\n booktitle = {Allerton Conference on Communication, Control, and Computing, Illinois},\n month = {September},\n note = {},\n pages = {},\n tags = {conf,DivEmb,SucRefDiv,STcodes,OppComm,DegMsgSet},\n title = {On successive refinement of diversity},\n type = {4},\n year = {2004}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);